Boolean circuit

Results: 103



#Item
31Quantum boolean functions

Quantum boolean functions

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2011-06-02 14:40:27
32ChipDesigner% CUPL compatible $BIT Window NT based EDA Tool for Programmable Logic  Logical Devices. Inc. announces a new fully integrated design tool for PLD and FPGA’s for the Windows NT platform

ChipDesigner% CUPL compatible $BIT Window NT based EDA Tool for Programmable Logic Logical Devices. Inc. announces a new fully integrated design tool for PLD and FPGA’s for the Windows NT platform

Add to Reading List

Source URL: www.logicaldevice.com

Language: English - Date: 2013-08-02 21:36:02
33Quantum boolean functions Ashley Montanaro∗ and Tobias J. Osborne† May 31, 2010 Abstract In this paper we introduce the study of quantum boolean functions, which are unitary

Quantum boolean functions Ashley Montanaro∗ and Tobias J. Osborne† May 31, 2010 Abstract In this paper we introduce the study of quantum boolean functions, which are unitary

Add to Reading List

Source URL: cjtcs.cs.uchicago.edu

Language: English - Date: 2011-06-03 17:28:45
34Local reductions Hamid Jahanjou∗ Eric Miles∗  Emanuele Viola∗

Local reductions Hamid Jahanjou∗ Eric Miles∗ Emanuele Viola∗

Add to Reading List

Source URL: www.ccs.neu.edu

Language: English - Date: 2014-04-01 09:13:02
35A The Complexity of the Comparator Circuit Value Problem STEPHEN A. COOK, Department of Computer Science, University of Toronto YUVAL FILMUS, Department of Computer Science, University of Toronto DAI TRI MAN LÊ, Departm

A The Complexity of the Comparator Circuit Value Problem STEPHEN A. COOK, Department of Computer Science, University of Toronto YUVAL FILMUS, Department of Computer Science, University of Toronto DAI TRI MAN LÊ, Departm

Add to Reading List

Source URL: www.cs.toronto.edu

Language: English - Date: 2014-04-02 14:14:13
36ECE 102: Digital Circuit Logic

ECE 102: Digital Circuit Logic

Add to Reading List

Source URL: www.engr.colostate.edu

Language: English - Date: 2013-09-24 15:54:27
37HEtest: A Homomorphic Encryption Testing Framework Mayank Varia1 , Sophia Yakoubov1 , and Yang Yang2,? 1 MIT Lincoln Laboratory?? , {mayank.varia, sophia.yakoubov}@ll.mit.edu 2

HEtest: A Homomorphic Encryption Testing Framework Mayank Varia1 , Sophia Yakoubov1 , and Yang Yang2,? 1 MIT Lincoln Laboratory?? , {mayank.varia, sophia.yakoubov}@ll.mit.edu 2

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-05-02 17:15:17
38Efficient Server-Aided Secure Two-Party Function Evaluation with Applications to Genomic Computation Marina Blanton and Fattaneh Bayatbabolghani Department of Computer Science and Engineering University of Notre Dame mbl

Efficient Server-Aided Secure Two-Party Function Evaluation with Applications to Genomic Computation Marina Blanton and Fattaneh Bayatbabolghani Department of Computer Science and Engineering University of Notre Dame mbl

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-05-09 22:08:08
39Armadillo: a compilation chain for privacy preserving applications Sergiu Carpov, Paul Dubrulle, Renaud Sirdey CEA, LIST, Embedded Real Time & Security Laboratory,

Armadillo: a compilation chain for privacy preserving applications Sergiu Carpov, Paul Dubrulle, Renaud Sirdey CEA, LIST, Embedded Real Time & Security Laboratory,

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2014-12-10 03:12:34
40ENTROPY OF OPERATORS OR WHY MATRIX MULTIPLICATION IS HARD FOR DEPTH-TWO CIRCUITS STASYS JUKNA Abstract. We consider unbounded fanin depth-2 circuits with arbitrary boolean functions as gates. We define the entropy of an

ENTROPY OF OPERATORS OR WHY MATRIX MULTIPLICATION IS HARD FOR DEPTH-TWO CIRCUITS STASYS JUKNA Abstract. We consider unbounded fanin depth-2 circuits with arbitrary boolean functions as gates. We define the entropy of an

Add to Reading List

Source URL: lovelace.thi.informatik.uni-frankfurt.de

Language: English - Date: 2009-01-13 11:44:18